Fast directional discrete cosine transform for image compression
نویسندگان
چکیده
منابع مشابه
Image Compression Using Discrete Wavelet Transform And Discrete Cosine Transform
The area of digital image processing has witness a great deal of development during the past few decades. Image compression is one of most important aspects of the fields. The paper presents simple and efficient algorithm for compressing image data, the algorithm involved using the glory wavelet transform technique, which was the most usable method for varied image processing field due to its r...
متن کاملImage Compression Using Discrete Cosine Transform & Discrete Wavelet Transform
Image compression plays a vital role in digital image processing. The need for image compression becomes apparent when number of bits per image are computed resulting from typical sampling rates and. quantization methods. For example, the amount of storage required for given images is (i) a low resolution, TV quality, color video image which has 512 x 512 pixels/color,8 bits/pixel, and 3 colors...
متن کاملImage Compression Using Discrete Cosine Transform
The main objective of the method is to provide the interesting part of the medical image on which different treatements are to be implemented. In medical image when some portion of image is to be selected, then ROI is selected with the help of Discrete Cosine Transform. It is used with the ROI technique to compress the medical image to remove the blocking effect. The different filters will be a...
متن کاملLossy Image Compression using Discrete Cosine Transform
In recent times the integration of video, audio and data in telecommunication devices has revolutionized the world communication. It has proven to be useful to almost every industry: the corporate world, entertainment industry, multimedia, education and even many household domestic appliances. The major problems encountered with these applications are the high data rates, high bandwidth and lar...
متن کاملFast discrete cosine transform pruning
A new fast pruning algorithm is proposed for computing the IV, lowest frequency components of a Iength-~V discrete cosine transform, where AVO is any integer less than or equal to N, and AV = 2“‘. The computational complexity of the developed algorithm is lower than any of the existing algorithms, resulting in significant time savings. In the special case that AVO = 2 “ Q , the required number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optical Engineering
سال: 2010
ISSN: 0091-3286
DOI: 10.1117/1.3306634